Roughening the $\mathcal{EL}$ Envelope
Identifieur interne : 001497 ( Main/Exploration ); précédent : 001496; suivant : 001498Roughening the $\mathcal{EL}$ Envelope
Auteurs : Rafael Pe Aloza [Allemagne] ; Tingting Zou [République populaire de Chine]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The $\mathcal{EL}$ family of description logics (DLs) has been successfully applied for representing the knowledge of several domains, specially from the bio-medical fields. One of its principal characteristics is that its reasoning tasks have polynomial complexity, which makes them suitable for large-scale knowledge bases. In their classical form, description logics cannot handle imprecise concepts in a satisfactory manner. Rough sets have been studied as a method for describing imprecise notions, by providing a lower and an upper approximation, which are defined through classes of indiscernible elements. In this paper we study the combination of the $\mathcal{EL}$ family of DLs with the notion of rough sets, thus obtaining a family of rough DLs. We show that the rough extension of these DLs maintains the polynomial-time complexity enjoyed by its classical counterpart. We also present a completion-based algorithm that is a strict generalization of the known method for the DL $\mathcal{EL}^{++}$ .
Url:
DOI: 10.1007/978-3-642-40885-4_6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003659
- to stream Istex, to step Curation: 003617
- to stream Istex, to step Checkpoint: 000123
- to stream Main, to step Merge: 001509
- to stream Main, to step Curation: 001497
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Roughening the $\mathcal{EL}$ Envelope</title><author><name sortKey="Pe Aloza, Rafael" sort="Pe Aloza, Rafael" uniqKey="Pe Aloza R" first="Rafael" last="Pe Aloza">Rafael Pe Aloza</name></author><author><name sortKey="Zou, Tingting" sort="Zou, Tingting" uniqKey="Zou T" first="Tingting" last="Zou">Tingting Zou</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E397B373C4098C1D55AF6B2BCB8EC57201D340C5</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40885-4_6</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-169HDHTS-2/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003659</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003659</idno><idno type="wicri:Area/Istex/Curation">003617</idno><idno type="wicri:Area/Istex/Checkpoint">000123</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000123</idno><idno type="wicri:doubleKey">0302-9743:2013:Pe Aloza R:roughening:the:mathcal</idno><idno type="wicri:Area/Main/Merge">001509</idno><idno type="wicri:Area/Main/Curation">001497</idno><idno type="wicri:Area/Main/Exploration">001497</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Roughening the <formula xml:id="IEq1" notation="TEX"><media mimeType="image" url=""></media>
$\mathcal{EL}$
</formula> Envelope</title><author><name sortKey="Pe Aloza, Rafael" sort="Pe Aloza, Rafael" uniqKey="Pe Aloza R" first="Rafael" last="Pe Aloza">Rafael Pe Aloza</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Theoretical Computer Science, TU Dresden Center for Advancing Electronics Dresden</wicri:regionArea><wicri:noRegion>TU Dresden Center for Advancing Electronics Dresden</wicri:noRegion><wicri:noRegion>TU Dresden Center for Advancing Electronics Dresden</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Zou, Tingting" sort="Zou, Tingting" uniqKey="Zou T" first="Tingting" last="Zou">Tingting Zou</name><affiliation wicri:level="4"><country xml:lang="fr">République populaire de Chine</country><wicri:regionArea>College of Computer Science and Technology, Jilin University</wicri:regionArea><placeName><settlement type="city">Changchun</settlement><region type="province">Jilin</region></placeName><orgName type="university">Université de Jilin</orgName></affiliation><affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The $\mathcal{EL}$ family of description logics (DLs) has been successfully applied for representing the knowledge of several domains, specially from the bio-medical fields. One of its principal characteristics is that its reasoning tasks have polynomial complexity, which makes them suitable for large-scale knowledge bases. In their classical form, description logics cannot handle imprecise concepts in a satisfactory manner. Rough sets have been studied as a method for describing imprecise notions, by providing a lower and an upper approximation, which are defined through classes of indiscernible elements. In this paper we study the combination of the $\mathcal{EL}$ family of DLs with the notion of rough sets, thus obtaining a family of rough DLs. We show that the rough extension of these DLs maintains the polynomial-time complexity enjoyed by its classical counterpart. We also present a completion-based algorithm that is a strict generalization of the known method for the DL $\mathcal{EL}^{++}$ .</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>République populaire de Chine</li></country><region><li>Jilin</li></region><settlement><li>Changchun</li></settlement><orgName><li>Université de Jilin</li></orgName></list><tree><country name="Allemagne"><noRegion><name sortKey="Pe Aloza, Rafael" sort="Pe Aloza, Rafael" uniqKey="Pe Aloza R" first="Rafael" last="Pe Aloza">Rafael Pe Aloza</name></noRegion><name sortKey="Pe Aloza, Rafael" sort="Pe Aloza, Rafael" uniqKey="Pe Aloza R" first="Rafael" last="Pe Aloza">Rafael Pe Aloza</name></country><country name="République populaire de Chine"><region name="Jilin"><name sortKey="Zou, Tingting" sort="Zou, Tingting" uniqKey="Zou T" first="Tingting" last="Zou">Tingting Zou</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001497 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001497 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:E397B373C4098C1D55AF6B2BCB8EC57201D340C5
|texte= Roughening the $\mathcal{EL}$ Envelope
}}
| This area was generated with Dilib version V0.6.33. |  |